Consistent iterative algorithm for stochastic dynamic traffic assignment with a stable route set

In stochastic (dynamic) traffic assignment (DTA), route choice (RC) formulations with implicit set require less memory than their explicit counterparts. To compute turn probabilities, however, a topological ordering of the nodes is needed, which negatively impacts stability convergence and consistency equilibrium. This paper formulates general framework for RC module efficient DTA (ESDTA) without ordering; we demonstrate how its full fixed yields smooth consistent convergence. The theoretical requires series computational modifications to ensure that numerical errors remain limited make formulation more use in practice. resulting ESDTA's computation time reach equilibrium scales linearly respect all relevant complexity dimensions (network size, demand zones, resolution, congestion level).